Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton
نویسندگان
چکیده
Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present new bounds on the number of new transitions for several ε-transitions-removal problems. We study the case of acyclic WFA. We introduce a new problem, the partial removal of ε-transitions while accepting short chains of ε-transitions.
منابع مشابه
Path-Equivalent Developments in Acyclic Weighted Automata
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ε-transitions-removal problem. ...
متن کاملThe Validity of Weighted Automata
This paper addresses the problem of the validity of weighted automata in which the presence of ε-circuits results in infinite summations. Earlier works either rule out such automata or characterise the semirings in which these infinite sums are all well-defined. By means of a topological approach, we take here a definition of validity that is strong enough to insure that in any kind of semiring...
متن کاملEfficient weighted expressions conversion
J. Hromkovic̃ et al. have given an elegant method to convert a regular expression of size n into an ε-free nondeterministic finite automaton having O(n) states and O(n log(n)) transitions. This method has been implemented efficiently in O(n log(n)) time by C. Hagenah and A. Muscholl. In this paper we extend this method to weighted regular expressions and we show that it can be achieved in O(n lo...
متن کاملBiclique coverings, rectifier networks and the cost of $\varepsilon$-removal
We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number Cov(G) and the minimal rectifier network size Rect(G) of a bipartite graph G. We show that there exist graphs with Cov(G) ≥ Rect(G). As a corollary, we establish that there exist nondeterministic finite automata (NFAs) with εtransitions, having n transitions total such that the smallest equivalent ...
متن کاملAlgebraic elimination of ε-transitions
We here describe a method of removing the ε-transitions of a weighted automaton. The existence of a solution for this removal depends on the existence of the star of a single matrix which, in turn, is based on the computation of the stars of scalars in the ground semiring. We discuss two aspects of the star problem (by infinite sums and by equations) and give an algorithm to suppress the ε-tran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006